Convex Relaxation of Optimal Power Flow—Part II: Exactness
نویسندگان
چکیده
منابع مشابه
Convex Relaxation of Optimal Power Flow - Part II: Exactness
This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relations among them. Part II presents sufficient conditions under which the convex relaxations are exact. Citation: I...
متن کاملConvex Relaxation of Optimal Power Flow - Part I: Formulations and Equivalence
This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relations among them. Part II presents sufficient conditions under which the convex relaxations are exact. Citation: I...
متن کاملNear-Optimal Joint Object Matching via Convex Relaxation
Joint matching over a collection of objects aims at aggregating information from a large collection of similar instances (e.g. images, graphs, shapes) to improve maps between pairs of them. Given multiple objects and matches computed between a few object pairs in isolation, the goal is to recover an entire collection of maps that are (1) globally consistent, and (2) close to the provided maps —...
متن کاملConvex relaxation for IMSE optimal design in random-field models
The de nition of an Integrated Mean-Squared Error (IMSE) criterion for the learning of a random eld model yields a particular Karhunen-Loève expansion of the underlying eld. The model can thus also be interpreted as a Bayesian (or regularised) linear model based on eigenfunctions of this Karhunen-Loève expansion, and can be approximated by a linear model involving orthogonal observation errors....
متن کاملA perspective-based convex relaxation for switched-affine optimal control
We consider the switched-affine optimal control problem, i.e., the problem of selecting a sequence of affine dynamics from a finite set in order to minimize a sum of convex functions of the system state. We develop a new reduction of this problem to a mixed-integer convex program (MICP), based on perspective functions. Relaxing the integer constraints of this MICP results in a convex optimizati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2014
ISSN: 2325-5870
DOI: 10.1109/tcns.2014.2323634